A New Construction Algorithm for Symmetrical Reversible Variable-Length Codes from the Huffman Code
نویسندگان
چکیده
Variable-length codes (VLCs) improve coding performance using statistical characteristics of source symbols; however, VLCs have disastrous effects from bit errors in noisy transmission environments. In order to overcome problems with VLCs, reversible variable-length codes (RVLCs) have been introduced as one of the error resilience tools due to their error recovering capability for corrupted video streams. Still, existing RVLCs are complicated in the design and have some rooms for improvement in coding efficiency. In this paper, we propose a new design method for a symmetrical RVLC from the optimal Huffman code table. The proposed algorithm has a simpler construction process and also demonstrates an improved performance in terms of the average codeword length than other symmetrical RVLC algorithms.
منابع مشابه
Generic Code Design Algorithms for Reversible Variable-length Codes from the Huffman Code
Variable-length codes (VLCs) are generally employed to improve compression efficiency using data statistics. However, VLCs are weak to bit errors in noisy transmission environments such as wireless channel. Recently, reversible variable-length codes (RVLCs) have been introduced due to their capability of recovering information from corrupted compressed streams; hence, enhancing the robustness o...
متن کاملConstruction of Symmetrical Reversible Variable Length Codes Using Backtracking
Many coding standards, such as JPEG, H.261, H.263, MPEG-1, MPEG-2, use variable length codes (VLC) as their entropy coding strategy. However, VLC have a big drawback when transmitting over a noisy channel. This drawback is an error propagation problem. For this reason, reversible variable length codes (RVLC) have been used to enhance the error resilient capabilities of VLC. This paper presents ...
متن کاملSelf Synchronising T-codes to Replace Huffman Codes
This paper describes recent work on the T-Codes, which are a new class of variable length codes with superlative selfsynchronizing properties. The T-Code construction algorithm i s outlined, and it is shown that in situations where codeword synchronization is important the T-Codes can be used instead of Huffman codes, giving excellent self-synchronizing properties without sacrificing coding eff...
متن کاملUsing an innovative coding algorithm for data encryption∗
This paper discusses the problem of using data compression for encryption. We first propose an algorithm for breaking a prefix-coded file by enumeration. Based on the algorithm, we respectively analyze the complexity of breaking Huffman codes and Shannon-Fano-Elias codes under the assumption that the cryptanalyst knows the code construction rule and the probability mass function of the source. ...
متن کاملT - Complexity and T - Information Theory – an Executive Summary , 2 nd revised version
This paper describes the derivation of the T-complexity and T-information theory from the decomposition of finite strings, based on the duality of strings and variable-length T-codes. It further outlines its similarity to the string parsing algorithm by Lempel and Ziv. In its first version [15], it was intended as a summary of work published mainly by Titchener and Nicolescu. Apart from minor c...
متن کامل